An Ant Colony Optimisation Algorithm for the Set Packing Problem Xavier GANDIBLEUX1,2 , Xavier DELORME2 and Vincent T’KINDT3 (1) LINA - Laboratoire d’Informatique de Nantes Atlantique Universite de Nantes 2 rue de la

Source URL: www.emse.fr

MIC2005: The Sixth Metaheuristics International Conference ??-1 An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure

Source URL: www.emse.fr

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

Source URL: www.daviddelaat.nl

• Graph theory
• Mathematics
• NP-complete problems
• Information theory
• Combinatorial optimization
• NP-hard problems
• Lovsz number
• Independent set

Une heuristique hybride pour le problème de set packing biobjectif Xavier Delorme 1,2 , Xavier Gandibleux2,3 et Fabien DEGOUTIN2,4 1. Ecole Nationale Supérieure des Mines de Saint-Etienne Centre : Génie Industriel et

Source URL: www.emse.fr

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover

Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress

Source URL: www.daviddelaat.nl

• Mathematics
• Geometry
• Discrete geometry
• NP-complete problems
• Circle packing
• Conjectures
• Operations research
• Sphere packing
• Independent set
• Tammes problem
• Kepler conjecture
• Semidefinite programming

Une heuristique hybride pour le problème de set packing biobjectif X. Delorme1 , X. Gandibleux1,2 , et F. Degoutin1,3 1 2

Source URL: www.emse.fr

Résolution approchée du problème de set packing bi-objectif Xavier Delorme 1,2 , Xavier Gandibleux2 et Fabien DEGOUTIN1,2 1. Laboratoire d’Automatique, de Mécanique et d’Informatique industrielles et Humaines

Source URL: www.emse.fr

Genome Informatics 13: 143–Point Matching Under Non-Uniform Distortions and Protein Side Chain Packing Based on an Efficient

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Independent set
• Clique problem
• Algorithm
• Clique
• Matching